翻訳と辞書 Words near each other ・ Numbered Doors ・ Numbered highways in Canada ・ Numbered highways in Kentucky ・ Numbered highways in Mexico ・ Numbered highways in the United States ・ Numbered Men ・ Numbered musical notation ・ Numbered roads in Indiana ・ Numbered routes in Rhode Island ・ Numbered routes in South Africa ・ Numbered street ・ Numbered streets of St. Louis ・ Numbered Treaties ・ NumberFire ・ NumberGuru ・ Numbering (computability theory) ・ Numbering Resource Utilization/Forecast Report ・ Numbering scheme ・ Numberjacks ・ Numberlink ・ Numbers & Mumbles ・ Numbers (band) ・ Numbers (Cat Stevens album) ・ Numbers (Jason Michael Carroll album) ・ Numbers (Lost) ・ Numbers (magazine) ・ Numbers (MellowHype album) ・ Numbers (record label) ・ Numbers (Rufus album) ・ Numbers (spreadsheet) Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Numbering (computability theory) ： ウィキペディア英語版 Numbering (computability theory) In computability theory a numbering is the assignment of natural numbers to a set of objects such as functions, rational numbers, graphs, or words in some language. A numbering can be used to transfer the idea of computability and related concepts, which are originally defined on the natural numbers using computable functions, to these different types of objects. Common examples of numberings include Gödel numberings in first-order logic and admissible numberings of the set of partial computable functions. == Definition and examples == A numbering of a set $S\; \backslash !$ is a surjective partial function from $\backslash mathbb$ to ''S'' (Ershov 1999:477). The value of a numbering ν at a number ''i'' (if defined) is often written ν'i'' instead of the usual $\backslash nu(i)\; \backslash !$. For example, the set of all finite subsets of $\backslash mathbb$ has a numbering γ in which $\backslash gamma(\backslash emptyset)\; =\; 0$ and $\backslash gamma(\backslash )\; =\; \backslash sum\_\; 2^$ (Ershov 1999:477). As a second example, a fixed Gödel numbering $\backslash varphi\_i$ of the computable partial functions can be used to define a numbering ''W'' of the recursively enumerable sets, by letting by ''W''(''i'') be the domain of φ''i''. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Numbering (computability theory)」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.